TSTP Solution File: SET630^3 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : SET630^3 : TPTP v8.1.2. Released v3.6.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.Ib2qLfUEC7 true
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 16:15:10 EDT 2023
% Result : Theorem 1.31s 0.75s
% Output : Refutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 14
% Syntax : Number of formulae : 22 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 26 ( 9 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 90 ( 18 ~; 6 |; 20 &; 46 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 35 ( 24 ^; 6 !; 5 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(intersection_type,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(excl_union_type,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(sk__4_type,type,
sk__4: $i > $o ).
thf(sk__5_type,type,
sk__5: $i ).
thf(misses_type,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(sk__3_type,type,
sk__3: $i > $o ).
thf(misses,axiom,
( misses
= ( ^ [X: $i > $o,Y: $i > $o] :
~ ? [U: $i] :
( ( Y @ U )
& ( X @ U ) ) ) ) ).
thf('0',plain,
( misses
= ( ^ [X: $i > $o,Y: $i > $o] :
~ ? [U: $i] :
( ( Y @ U )
& ( X @ U ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[misses]) ).
thf('1',plain,
( misses
= ( ^ [V_1: $i > $o,V_2: $i > $o] :
~ ? [X4: $i] :
( ( V_2 @ X4 )
& ( V_1 @ X4 ) ) ) ),
define([status(thm)]) ).
thf(intersection,axiom,
( intersection
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
& ( Y @ U ) ) ) ) ).
thf('2',plain,
( intersection
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
& ( Y @ U ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[intersection]) ).
thf('3',plain,
( intersection
= ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
( ( V_1 @ V_3 )
& ( V_2 @ V_3 ) ) ) ),
define([status(thm)]) ).
thf(excl_union,axiom,
( excl_union
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( ( X @ U )
& ~ ( Y @ U ) )
| ( ~ ( X @ U )
& ( Y @ U ) ) ) ) ) ).
thf('4',plain,
( excl_union
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( ( X @ U )
& ~ ( Y @ U ) )
| ( ~ ( X @ U )
& ( Y @ U ) ) ) ) ),
inference(simplify_rw_rule,[status(thm)],[excl_union]) ).
thf('5',plain,
( excl_union
= ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
( ( ( V_1 @ V_3 )
& ~ ( V_2 @ V_3 ) )
| ( ~ ( V_1 @ V_3 )
& ( V_2 @ V_3 ) ) ) ) ),
define([status(thm)]) ).
thf(thm,conjecture,
! [X: $i > $o,Y: $i > $o] : ( misses @ ( intersection @ X @ Y ) @ ( excl_union @ X @ Y ) ) ).
thf(zf_stmt_0,conjecture,
! [X4: $i > $o,X6: $i > $o] :
~ ? [X8: $i] :
( ( ( ( X4 @ X8 )
& ~ ( X6 @ X8 ) )
| ( ~ ( X4 @ X8 )
& ( X6 @ X8 ) ) )
& ( X4 @ X8 )
& ( X6 @ X8 ) ) ).
thf(zf_stmt_1,negated_conjecture,
~ ! [X4: $i > $o,X6: $i > $o] :
~ ? [X8: $i] :
( ( ( ( X4 @ X8 )
& ~ ( X6 @ X8 ) )
| ( ~ ( X4 @ X8 )
& ( X6 @ X8 ) ) )
& ( X4 @ X8 )
& ( X6 @ X8 ) ),
inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl4,plain,
( ~ ( sk__4 @ sk__5 )
| ~ ( sk__3 @ sk__5 ) ),
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl0,plain,
sk__4 @ sk__5,
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl1,plain,
sk__3 @ sk__5,
inference(cnf,[status(esa)],[zf_stmt_1]) ).
thf(zip_derived_cl10,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl4,zip_derived_cl0,zip_derived_cl1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET630^3 : TPTP v8.1.2. Released v3.6.0.
% 0.11/0.13 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.Ib2qLfUEC7 true
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 07:50:10 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.36 % Running in HO mode
% 0.21/0.67 % Total configuration time : 828
% 0.21/0.67 % Estimated wc time : 1656
% 0.21/0.67 % Estimated cpu time (8 cpus) : 207.0
% 0.21/0.71 % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 1.31/0.75 % Solved by lams/40_c.s.sh.
% 1.31/0.75 % done 5 iterations in 0.010s
% 1.31/0.75 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 1.31/0.75 % SZS output start Refutation
% See solution above
% 1.31/0.75
% 1.31/0.75
% 1.31/0.75 % Terminating...
% 1.66/0.87 % Runner terminated.
% 1.66/0.88 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------